package ACWing.SearchAndGraphTheory.BFS;
//73. 矩阵距离

import java.util.Scanner;

/**
 * @author :chenjie
 * @date :Created 2022/12/23 20:49
 */
public class DistanceMatrix {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n= sc.nextInt();
        int m= sc.nextInt();
        int[][]arr=new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                arr[i][j]=sc.nextInt();
            }
        }


    }
}
